asymptotic result

asymptotic result
мат.
асимптотический результат

English-Russian scientific dictionary. 2008.

Игры ⚽ Нужно сделать НИР?

Смотреть что такое "asymptotic result" в других словарях:

  • Asymptotic theory — is the branch of mathematics which studies properties of asymptotic expansions.The most known result of this field is the prime number theorem:Let pi;( x ) be the number of prime numbers that are smaller than or equal to x .The limit:lim {x… …   Wikipedia

  • Asymptotic analysis — This article is about the comparison of functions as inputs approach infinite. For asymptotes in geometry, see asymptotic curve. In mathematical analysis, asymptotic analysis is a method of describing limiting behavior. The methodology has… …   Wikipedia

  • Asymptotic equipartition property — In information theory the asymptotic equipartition property (AEP) is a general property of the output samples of a stochastic source. It is fundamental to the concept of typical set used in theories of compression.Roughly speaking, the theorem… …   Wikipedia

  • Prime number theorem — PNT redirects here. For other uses, see PNT (disambiguation). In number theory, the prime number theorem (PNT) describes the asymptotic distribution of the prime numbers. The prime number theorem gives a general description of how the primes are… …   Wikipedia

  • Hilbert matrix — In linear algebra, a Hilbert matrix is a matrix with the unit fraction elements: H {ij} = frac{1}{i+j 1}. For example, this is the 5 times; 5 Hilbert matrix::H = egin{bmatrix} 1 frac{1}{2} frac{1}{3} frac{1}{4} frac{1}{5} [4pt] frac{1}{2}… …   Wikipedia

  • Brauer-Siegel theorem — In mathematics, the Brauer Siegel theorem, named after Richard Brauer and Carl Ludwig Siegel, is an asymptotic result on the behaviour of algebraic number fields, obtained by Richard Brauer and Carl Ludwig Siegel. It attempts to generalise the… …   Wikipedia

  • Brun–Titchmarsh theorem — In analytic number theory, the Brun–Titchmarsh theorem is an upper bound on the distribution of primes in arithmetic progression. It states that, if pi(x;a,q) counts the number of primes p congruent to a modulo q with p ≤ x , then:pi(x;a,q) le… …   Wikipedia

  • Bayesian information criterion — In statistics, in order to describe a particular dataset, one can use non parametric methods or parametric methods. In parametric methods, there might be various candidate models with different number of parameters to represent a dataset. The… …   Wikipedia

  • Secretary problem — The secretary problem is an optimal stopping problem that has been studied extensively in the fields of applied probability, statistics, and decision theory. It is also known as the marriage problem, the sultan s dowry problem, the fussy suitor… …   Wikipedia

  • Erdős–Stone theorem — In extremal graph theory, the Erdős–Stone theorem is an asymptotic result generalising Turán s theorem to bound the number of edges in an H free graph for a non complete graph H . It is named after Paul Erdős and Arthur Stone, who proved it in… …   Wikipedia

  • Rule of three (medicine) — The rule of three states that, if no major adverse events occurred in a clinical trial of a drug, then there can be 95% confidence that major adverse events do not happen more often than one in n/3 people, where n is the number of people in the… …   Wikipedia


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»